Performance Evaluation of Deterministic Guarantees

We evaluate the performance of scheme providing deterministic performance guarantees to real-time network clients with variable bit-rate (VBR) traac. We use long traces of video compressed using diierent algorithms for our analysis. The optimal scheduling algorithm EDD is used to carry out the analysis. Improved admission control tests for EDD scheduler are derived. We compare performance of the Xmin; Xavg; I traf-c model initially proposed by Tenet Group at UC Berkeley with the leaky bucket model. Our studies supplement that leaky bucket model as speciied in UNI signaling speciications of ATM-Forum is better than Xmin; Xavg; I traac model. We computer maximum achievable network utilization for real-time VBR only traac. The maximum achievable network utilization for real-time VBR traac is found to vary between 14.4 % to 70 %. If the fraction of CBR and ABR traac is good then very high network utilization can be achieved.